Convexifying Polygons Without Losing Visibilities

نویسندگان

  • Oswin Aichholzer
  • Greg Aloupis
  • Erik D. Demaine
  • Martin L. Demaine
  • Vida Dujmovic
  • Ferran Hurtado
  • Anna Lubiw
  • Günter Rote
  • André Schulz
  • Diane L. Souvaine
  • Andrew Winslow
چکیده

We show that any simple n-vertex polygon can be made convex, without losing internal visibilities between vertices, using n moves. Each move translates a vertex of the current polygon along an edge to a neighbouring vertex. In general, a vertex of the current polygon represents a set of vertices of the original polygon that have become co-incident. We also show how to modify the method so that vertices become very close but not co-incident. The proof involves a new visibility property of polygons, namely that every simple polygon has a visibilityincreasing edge where, as a point travels from one endpoint of the edge to the other, the visibility region of the point increases.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convexifying Monotone Polygons while Maintaining Internal Visibility

Let P be a simple polygon on the plane. Two vertices of P are visible if the open line segment joining them is contained in the interior of P . In this paper we study the following questions posed in [5, 6]: (1) Is it true that every non-convex simple polygon has a vertex that can be continuously moved such that during the process no vertex-vertex visibility is lost and some vertex-vertex visib...

متن کامل

Convexifying Monotone Polygons

This paper considers reconngurations of polygons, where each polygon edge is a rigid link, no two of which can cross during the motion. We prove that one can reconngure any monotone polygon into a convex polygon; a polygon is monotone if any vertical line intersects the interior at a (possibly empty) interval. Our algorithm computes in O(n 2) time a sequence of O(n 2) moves, each of which rotat...

متن کامل

Implementing contract net in tuple space models

Coordination is essential in distributed computing, which involves a group of loosely coupled agents cooperating in order to solve problems in a decentralised fashion. One of the popular approaches of coordination is the generative tuple space based communication, where agents interact via a shared data space. This paper discusses the implementation of Contract Net protocol (CNP) in a number of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011